A Study on Simplified-DBR Scheduling in Job Shop Environment with Due Dates
نویسندگان
چکیده
منابع مشابه
Job Shop Scheduling with Fixed Delivery Dates
Abstract—In most classical scheduling models, a job is assumed to deliver to a customer at the instant of a job processing completion. In numerous practical situations, however, multiple delivery dates exist, where the time interval between any two consecutive delivery dates is constant. This type of fixed delivery strategy results in substantial cost savings for transportation and handling. Th...
متن کاملJob-shop scheduling in a body shop
We study a generalized job-shop problem called the body shop scheduling problem (BSSP). This problem arises from the industrial application of welding in a car body production line, where possible collisions between industrial robots have to be taken into account. BSSP corresponds to a job-shop problem where the operations of a job have to follow alternating routes on the machines, certain oper...
متن کاملAnalysis of reactive scheduling problems in a job shop environment
In this paper, we study the reactive scheduling problems in a stochastic manufacturing environment. Speci®cally, we test the several scheduling policies under machine breakdowns in a classical job shop system. In addition, we measure the eect of system size and type of work allocation (uniform and bottleneck) on the system performance. The performance of the system is measured for the mean tar...
متن کاملSingle Machine Scheduling with Distinct Due Dates under Fuzzy Environment
Single machine, distinct due dates, early/lately machine problem and fuzzy environment closely models the situation faced by ‘Just In Time’ manufacturing. The objective of this paper is to sequence the jobs on the machine, so that the total penalty cost be minimum. This cost is composed of the total earliness and the total tardiness cost. An algorithm is developed here to minimize the total pen...
متن کاملJob Shop Scheduling With Deadlines
In this paper we deal with a variant of the Job Shop Scheduling Problem. We consider the addition of release dates and deadlines to be met by all jobs. The objective is makespan minimization if there are no tardy jobs, and tardiness minimization otherwise. The problem is approached by using a Shifting Bottleneck strategy. The presence of deadlines motivates an iterative use of a particular one ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IE interfaces
سال: 2012
ISSN: 1225-0996
DOI: 10.7232/ieif.2012.25.1.106